Nondeterministic finite automaton

Results: 144



#Item
21Computer science / Applied mathematics / Nondeterministic finite automaton / Markov chain / Probabilistic automaton / Deterministic finite automaton / Finite-state machine / Automata theory / Models of computation / Theoretical computer science

5 Representing distributions over strings with automata and grammars T

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2010-07-20 08:11:02
22Software engineering / Computing / Abstraction / Deterministic finite automaton / Abstract interpretation / Nondeterministic finite automaton / Finite-state machine / Automata theory / Models of computation / Computer science

1 Static Specification Mining Using Automata-Based Abstractions Sharon Shoham

Add to Reading List

Source URL: www.cs.technion.ac.il

Language: English - Date: 2008-06-04 09:57:06
23Models of computation / Software engineering / Computing / Nondeterministic finite automaton / Deterministic finite automaton / Regular expression / Monad / Finite-state machine / Regular language / Automata theory / Formal languages / Theoretical computer science

The Monad.Reader Issue 16 by Aran Donohue and John W. Lato and Louis Wasserman May 12, 2010

Add to Reading List

Source URL: themonadreader.files.wordpress.com

Language: English - Date: 2010-05-12 14:00:40
24Mathematics / Formal methods / Nondeterministic finite automaton / Linear temporal logic / Finite-state machine / Function / Symbol / Büchi automaton / Automata theory / Models of computation / Theoretical computer science

Synthesis for Regular Specifications over Unbounded Domains Jad Hamza∗, Barbara Jobstmann†, Viktor Kuncak‡ ∗ ENS Cachan, France † CNRS/Verimag, France, ‡ EPFL, Switzerland

Add to Reading List

Source URL: lara.epfl.ch

Language: English - Date: 2010-08-02 10:05:45
25Applied mathematics / Nondeterministic finite automaton / Powerset construction / Deterministic finite automaton / Regular expression / Finite-state machine / Regular language / Symbol / String / Automata theory / Theoretical computer science / Computer science

Models of Computation Lecture 4: Nondeterministic Automata [Fa’14] Caveat lector! This is the first edition of this lecture note. Some topics are incomplete, and there are almost certainly a few serious errors. Please

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 09:05:08
26Computer science / DFA minimization / Finite-state machine / Deterministic finite automaton / Nondeterministic finite automaton / Automata theory / Models of computation / Theoretical computer science

Models of Computation Lecture 3: Finite-State Machines [Fa’14] Caveat lector! This is the first edition of this lecture note. A few topics are missing, and there are almost certainly a few serious errors. Please send

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 09:05:05
27Computer science / Formal methods / Deterministic finite automaton / Nondeterministic finite automaton / Finite-state machine / X-machine / Non-deterministic Turing machine / Ω-automaton / Finite state transducer / Models of computation / Automata theory / Theoretical computer science

Computing with Relational Machines G´erard Huet and Benoˆıt Razet INRIA Paris-Rocquencourt ICON’2008 Tutorial, Pune, DecemberAbstract. We give a quick presentation of the X-machines of Eilenberg, a generalisa

Add to Reading List

Source URL: pauillac.inria.fr

Language: English - Date: 2008-12-14 19:37:35
28Finite-state machine / Computing / Mathematics / Deterministic pushdown automaton / Automata theory / Models of computation / Nondeterministic finite automaton

On system rollback and totalised fields An algebraic approach to system change Mark Burgess and Alva Couch 20th June 2011 This paper is dedicated to Jan Bergstra on the occasion of his 60th birthday.

Add to Reading List

Source URL: markburgess.org

Language: English - Date: 2014-12-18 08:35:34
29Ω-automaton / Deterministic finite automaton / Tree automaton / Nondeterministic finite automaton / Omega language / Sequence / Muller automaton / Büchi automaton / Automata theory / Theoretical computer science / Computer science

Efficient Inclusion Testing for Simple Classes of Unambiguous ω-Automata Dimitri Isaaka , Christof L¨odinga a Informatik 7, RWTH Aachen, Germany

Add to Reading List

Source URL: www.automata.rwth-aachen.de

Language: English - Date: 2012-05-29 11:02:30
30Finite-state machine / Nondeterministic finite automaton / Computer chess / Robot / Chess / Ω-automaton / Automata theory / Models of computation / Games

FREE WILL—EVEN FOR ROBOTS John McCarthy Computer Science Department Stanford University Stanford, CA 94305, USA

Add to Reading List

Source URL: www-formal.stanford.edu

Language: English - Date: 2002-03-26 18:13:58
UPDATE